A fully discrete plates complex on polygonal meshes with application to the Kirchhoff–Love problem
نویسندگان
چکیده
In this work we develop a novel fully discrete version of the plates complex, an exact Hilbert complex relevant for mixed formulation fourth-order problems. The derivation follows de Rham paradigm, leading to arbitrary-order construction that applies meshes composed general polygonal elements. is then used derive numerical scheme Kirchhoff–Love plates, which full stability and convergence analysis are performed. Extensive tests complete exposition.
منابع مشابه
A Fully Discrete ε-Uniform Method for Convection-Diffusion Problem on Equidistant Meshes
For a singularly-perturbed two-point boundary value problem, we propose an ε-uniform finite difference method on an equidistant mesh which requires no exact solution of a differential equation. We start with a full-fitted operator method reflecting the singular perturbation nature of the problem through a local boundary value problem. However, to solve the local boundary value problem, we emplo...
متن کاملOn the Rigidity of Polygonal Meshes
A polygonal mesh is a connected subset of a polyhedral surface. We address the problem whether the intrinsic metric of a mesh, i.e., its development, can determine the exterior metric. If this is the case then the mesh is rigid. Among the non-rigid cases even flexible versions are possible. We concentrate on quadrangular meshes and in particular on a mesh with a flat pose in which the quadrangl...
متن کاملA Stream Virtual Element Formulation of the Stokes Problem on Polygonal Meshes
In this paper we propose and analyze a novel stream formulation of the Virtual Element Method (VEM) for the solution of the Stokes problem. The new formulation hinges upon the introduction of a suitable stream function space (characterizing the divergence free subspace of discrete velocities) and it is equivalent to the velocity-pressure (inf-sup stable) mimetic scheme presented in [8] (up to a...
متن کاملProgressive Polygonal Meshes
In this work we build a progressive polygonal mesh based on face clustering. The basic simplification operations are the edge-removal and the edge-join operations. There is no need to tessellate non-triangular models as the proposed representation is fully polygonal. We investigate three different error measures to build the progressive representation based on a priority queue based face cluste...
متن کاملFast Neighborhood Search on Polygonal Meshes
We introduce a spatial index to support the fast retrieval of large neighborhoods of points on a polygonal mesh. Our spatial index can be computed efficiently off-line, introducing a negligible overhead over a standard indexed data structure. In retrieving neighborhoods of points on-line, we achieve a speed-up of about one order of magnitude with respect to standard topological traversal, while...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2022
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3765